bit-by-bit modulo-two addition

поразрядное (побитовое) сложение по mod 2

Англо-русский словарь по компьютерной безопасности. . 2011.

Смотреть что такое "bit-by-bit modulo-two addition" в других словарях:

  • Two's complement — The two s complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2 N for an N bit two s complement).A two s complement system or two s complement arithmetic is a… …   Wikipedia

  • Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… …   Wikipedia

  • Differential equations of addition — In cryptography, differential equations of addition (DEA) are one of the most basic equations related to differential cryptanalysis that mix additions over two different groups (e.g. addition modulo 232 and addition over GF(2)) and where input… …   Wikipedia

  • Scrambler — For other uses, see Scrambler (disambiguation). In telecommunications, a scrambler is a device that transposes or inverts signals or otherwise encodes a message at the transmitter to make the message unintelligible at a receiver not equipped with …   Wikipedia

  • Cover (telecommunications) — In telecommunications, cover is the technique of concealing or altering the characteristics of communications patterns for the purpose of denying an unauthorized receiver information that would be of value. The purpose of cover is not to make the …   Wikipedia

  • High-Level Data Link Control — (HDLC) is a bit oriented synchronous data link layer protocol developed by the International Organization for Standardization (ISO). The original ISO standards for HDLC were: *ISO 3309 mdash; Frame Structure *ISO 4335 mdash; Elements of Procedure …   Wikipedia

  • Format-preserving encryption — In cryptography, format preserving encryption (FPE) refers to encrypting in such a way that the output (the ciphertext) is in the same format as the input (the plaintext). The meaning of format varies. Typically only finite domains are discussed …   Wikipedia

  • Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial …   Wikipedia

  • Phase-shift keying — Passband modulation v · d · e Analog modulation AM · …   Wikipedia

  • Differential coding — In digital communications, differential coding is a technique used to provide unambiguous signal reception when using some types of modulation. It makes data to be transmitted to depend not only on the current bit (or symbol), but also on the… …   Wikipedia

  • Cryptanalysis of TIA's Common Cryptographic Algorithms — In 1992, the TR 45 working group within the Telecommunications Industry Association (TIA) developed a standard for integration of cryptographic technology into tomorrow s digital cellular systems [TIA92] , which has been updated at least once… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.